Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution
نویسندگان
چکیده
منابع مشابه
Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution
We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conjunctions. We prove that the weak pigeonhole principle PHPcn n and random unsatisfiable CNF formulas require exponential-size proofs in this system. This is the strongest system beyond Resolution for which such lower bou...
متن کاملLower Bounds for the Weak Pigeonhole Principle Beyond Resolution
We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conjunctions. We prove that the weak pigeonhole principle and random unsatisfiable CNF formulas require exponential-size proofs in this system. This is the strongest system beyond Resolution for which such lower bounds are ...
متن کاملImproved Resolution Lower Bounds for the Weak Pigeonhole Principle
Recently, Raz Raz01] established exponential lower bounds on the size of resolution proofs of the weak pigeonhole principle. We give another proof of this result which leads to better numerical bounds.
متن کاملResolution lower bounds for the weak functional pigeonhole principle
We show that every resolution proof of the functional version FPHPm n of the pigeonhole principle (in which one pigeon may not split between several holes) must have size exp ( Ω ( n (logm)2 )) . This implies an exp ( Ω(n1/3) ) bound when the number of pigeons m is arbitrary.
متن کاملP != NP, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle
Recent results established exponential lower bounds for the length of any Resolution proof for the weak pigeonhole principle. More formally, it was proved that any Resolution proof for the weak pigeonhole principle, with n holes and any number of pigeons, is of length fl(2 ), (for a constant e = 1/3). One corollary is that certain propositional formulations of the statement P / NP do not have s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2002
ISSN: 0890-5401
DOI: 10.1006/inco.2002.3114